Verifiable Secret Redistribution for Archive Systems
نویسندگان
چکیده
We present a new verifiable secret redistribution protocol for threshold sharing schemes that forms a key component of a proposed archival storage system. Our protocol supports redistribution from (m,n) to (m,n) threshold sharing schemes without requiring reconstruction of the original data. The design is motivated by archive systems for which the added security of threshold sharing of data must be accompanied by the flexibility of dynamic shareholder changes. Our protocol enables the dynamic addition or removal of shareholders, and also guards against mobile adversaries. We observe that existing protocols either cannot be extended readily to allow redistribution between different access structures, or have vulnerabilities that allow faulty old shareholders to distribute invalid shares to new shareholders. Our primary contribution is that in our protocol, new shareholders can verify the validity of their shares after redistribution between different access structures.
منابع مشابه
Verifiable Secret Redistribution (CMU-CS-01-155)
We present a new protocol to perform non-interactive verifiable secret redistribution (VSR) for secrets distributed with Shamir’s secret sharing scheme. We base our VSR protocol on Desmedt and Jajodia’s redistribution protocol for linear secret sharing schemes, which we specialize for Shamir’s scheme. We extend their redistribution protocol with Feldman’s non-interactive verifiable secret shari...
متن کاملSubmitted in Partial Fulfillment of the Requirements for the Degree Of
Verifiable secret sharing is a cryptographic primitive used in many distributed applications. To engineer realistic applications, it is beneficial to have dynamically changing shares and shareholder groups. Proactive secret sharing schemes deal with dynamically changing shares. Secret redistribution schemes solve issues of both dynamically changing shares and shareholder groups. In this dissert...
متن کاملVerifiable Secret Redistribution
We present a new protocol to perform non-interactive verifiable secret redistribution (VSR) for secrets distributed with Shamir’s secret sharing scheme. We base our VSR protocol on Desmedt and Jajodia’s redistribution protocol for linear secret sharing schemes, which we specialize for Shamir’s scheme. We extend their redistribution protocol with Feldman’s non-interactive verifiable secret shari...
متن کاملNon-Interactive and Information-Theoretic Secure Publicly Verifiable Secret Sharing
A publicly verifiable secret sharing scheme is more applicable than a verifiable secret sharing because of the property that the validity of the shares distributed by the dealer can be verified by any party. In this paper, we construct a non-interactive and informationtheoretic publicly verifiable secret sharing by a computationally binding and unconditionally hiding commitment scheme and zero-...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کامل